Quantum Algorithms for many-to-one Functions to Solve the Regulator and the Principal Ideal Problem

We propose new quantum algorithms to solve the regulator and the principal ideal problem in a real-quadratic number field. We improve the algorithms proposed by Hallgren ([Hal02b], [Hal07]) by using two different techniques. The first improvement is the usage of a period function which is not one-to-one on its period. We show that even in this case Shor’s algorithm computes the period with constant probability. The second improvement is the usage of reduced forms (a, b, c) of discriminant ∆ with a > 0 instead of reduced ideals of the same discriminant. These improvements reduce the number of required qubits by at least 2 log∆.